Evolving Path Generation Compliant Mechanisms (PGCM) using Local-search based Multi-objective Genetic Algorithm
نویسندگان
چکیده
Path generation compliant mechanisms (PGCM) are flexible structures which generate some desired path and/or transmit force by undergoing elastic deformation (under some applied load) instead of through rigid linkages/joints as in rigid body mechanism. In the present work, multi-objective problem is posed for evolving of PGCM using local-search based genetic algorithm. Minimization of weight of structure and minimization of input energy to the structure have been considered as two conflicting objective functions subjected to maximum of 10% of deviation between five precision points of prescribed path and corresponding five points obtained on the actual path of a specified point on structure after FEM analysis and a constraint on stress. Geometrical non-linear finite element model is used for the synthesis of PGCM. On the basis of the calculated function and constraint values, an evolutionary algorithm (NSGA-II) is used to find the optimal solution. A local search based multi-objective GA is used to reduce the computational time and improve the quality of GA solutions. The Pareto-optimal front obtained shows different trade-off solutions from minimum weight to the maximum weight of structure. The minimum weight solution is corresponding to the maximum input energy to the structure and vice-versa.
منابع مشابه
Developing Multiple Topologies of Path Generating Compliant Mechanism (PGCM) using Evolutionary Optimization
The present work aims to evolve the multiple topologies of path generating compliant mechanisms. The trade-off solution’s based topologies are developed by simultaneously minimization of weight and supplied input energy to elastic structures. The functional aspect of these compliant mechanisms is accomplished by imposing the constraints on precision points to generate the user-defined path. The...
متن کاملGeneration of Compliant Mechanisms using Hybrid Genetic Algorithm
Compliant mechanism is a single piece elastic structure which can deform to perform the assigned task. In this paper, the compliant mechanisms are evolved using a constraint based bi-objective optimization formulation which requires one user defined parameter (η). This user defined parameter limits a gap between a desired path and an actual path traced by the compliantmechanism. The non-linear ...
متن کاملAdvancement of Path Generating Compliant Mechanisms (PGCM) Topologies by Initial Population Strategy of Customized Evolutionary Algorithm
The present work demonstrates the advancement of evolved topologies of path generating compliant mechanisms by introducing initial population strategy with customized NSGA-II algorithm. The strategy is based on the categorization of design domain of compliant mechanisms that generates initial population of elastic continuum structures. It is anticipated in this paper that this strategy further ...
متن کاملA New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm
This paper presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...
متن کاملA Hybrid Algorithm using Firefly, Genetic, and Local Search Algorithms
In this paper, a hybrid multi-objective algorithm consisting of features of genetic and firefly algorithms is presented. The algorithm starts with a set of fireflies (particles) that are randomly distributed in the solution space; these particles converge to the optimal solution of the problem during the evolutionary stages. Then, a local search plan is presented and implemented for searching s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006